3-Number Theory-Theorem-Factorial
Stirling theorem
If n > 7, n! ~ n^n * e^-n * (2 * pi * n)^0.5, where n is integer, and e is base of natural logarithms {Stirling's theorem} {Stirling theorem} {Stirling's formula}.
Wilson theorem
Numbers equal to (p - 1)! + 1 are divisible by p if and only if p is prime {Wilson's theorem} {Wilson theorem}.
Related Topics in Table of Contents
3-Number Theory-Theorem
Drawings
Drawings
Contents and Indexes of Topics, Names, and Works
Outline of Knowledge Database Home Page
Contents
Glossary
Topic Index
Name Index
Works Index
Searching
Search Form
Database Information, Disclaimer, Privacy Statement, and Rights
Description of Outline of Knowledge Database
Notation
Disclaimer
Copyright Not Claimed
Privacy Statement
References and Bibliography
Consciousness Bibliography
Technical Information
Date Modified: 2022.0225